|
In queueing theory, a discipline within the mathematical theory of probability, a Markovian arrival process (MAP or MArP) is a mathematical model for the time between job arrivals to a system. The simplest such process is a Poisson process where the time between each arrival is exponentially distributed. The processes were first suggested by Neuts in 1979.〔 ==Definition== A Markov arrival process is defined by two matrices ''D''0 and ''D''1 where elements of ''D''0 represent hidden transitions and elements of ''D''1 observable transitions. The block matrix ''Q'' below is a transition rate matrix for a continuous-time Markov chain. : The simplest example is a Poisson process where ''D''0 = −''λ'' and ''D''1 = ''λ'' where there is only one possible transition, it is observable and occurs at rate ''λ''. For ''Q'' to be a valid transition rate matrix, the following restrictions apply to the ''D''''i'' : 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Markovian arrival process」の詳細全文を読む スポンサード リンク
|